Robust Distributed Constraint Reasoning
نویسندگان
چکیده
Distributed constraint reasoning (DCR) has recently generated much interest due to its ability to solve many real world problems without centralizing all of the information. Many DCR algorithms, however, are prone to failure if even a single agent fails, creating a situation with not only a central point of failure, but with n-points of failure! There are three main contributions of this work. First, we define the robust DCR problem space in terms of communications failures, agent failures and observability of failed agents. Then we describe two new types of algorithm modifications and show where they and other algorithms fit into this problem space. Finally, we analyze these algorithms and discuss what future work is needed in this area.
منابع مشابه
Dynamic Distributed Constraint Reasoning
What local action can agents take, without the benefit of global knowledge, to produce the best global solution? Many dynamic distributed systems can be modeled using techniques from distributed constraint reasoning, however, existing work in the distributed constraint reasoning community does not address the true dynamism inherent in many real-
متن کاملStochastic Game Modelling for Distributed Constraint Reasoning with Privacy
Privacy has been a major concern for agents in distributed constraint reasoning. In this work, we approach this issue in distributed constraint reasoning by letting agents compromise solution quality for preserving privacy, using utility theory. We formalize privacy in the context of distributed constraint reasoning, detail its different aspects, and present model and solvers, as well as their ...
متن کاملDISTRIBUTED CONSTRAINT OPTIMIZATION FOR MULTIAGENT SYSTEMS by Pragnesh
To coordinate effectively, multiple agents must reason and communicate about the interactions between their individual local decisions. Distributed planning, distributed scheduling, distributed resource allocation and distributed task allocation are some examples of multiagent problems where such reasoning is required. In order to represent these types of automated reasoning problems, researche...
متن کاملOn the ratio of communications to computation in DCR efficiency metrics
We propose a way to define the most expensive operation to be used in evaluations of complexity and efficiency for simulated distributed constraint reasoning (DCR) algorithms. We also report experiments showing that the cost associated with a constraint check, even within the same algorithm, depends on the problem size. The DCR research has seen heated debate regarding the correct way to evalua...
متن کاملSpace Applications for Distributed Constraint Reasoning
A potential weakness of any research is its applicability to real problems, and it is often difficult to determine whether a particular application needs a particular technology. Space missions offer a wide variety of multiagent problem domains, but the technology needs of these missions vary. Techniques developed by research in Distributed Constraint Reasoning (DCR) employ representations that...
متن کامل